Linear parallel algorithms to compute strong and branching bisimilarity
نویسندگان
چکیده
Abstract We present the first parallel algorithms that decide strong and branching bisimilarity in linear time. More precisely, if a transition system has n states, m transitions $$\vert Act \vert $$ | A c t action labels, we introduce an algorithm decides $$\mathcal {O}(n+\vert )$$ O ( n + ) time on $$\max (n,m)$$ max , m processors using up to (n^2,m,\vert n)$$ 2 processors.
منابع مشابه
GPU Accelerated Strong and Branching Bisimilarity Checking
Bisimilarity checking is an important operation to perform explicit-state model checking when the state space of a model under verification has already been generated. It can be applied in various ways: reduction of a state space w.r.t. a particular flavour of bisimilarity, or checking that two given state spaces are bisimilar. Bisimilarity checking is a computationally intensive task, and over...
متن کاملAlgorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains
In the late nineties, Desharnais, Gupta, Jagadeesan and Panangaden presented probabilistic bisimilarity distances on the states of a labelled Markov chain. This provided a quantitative generalisation of probabilistic bisimilarity introduced by Larsen and Skou a decade earlier. In the last decade, several algorithms to approximate and compute these probabilistic bisimilarity distances have been ...
متن کاملBranching Bisimilarity with Explicit Divergence
We consider the relational characterisation of branching bisimilarity with explicit divergence. We prove that it is an equivalence and that it coincides with the original definition of branching bisimilarity with explicit divergence in terms of coloured traces. We also establish a correspondence with several variants of an action-based modal logic with untiland divergence modalities.
متن کاملBranching Bisimilarity Checking for PRS
Recent studies reveal that branching bisimilarity is decidable for both nBPP (normed Basic Parallel Processes) and nBPA (normed Basic Process Algebras). These results lead to the question if there are any other models in the hierarchy of PRS (Process Rewrite Systems) whose branching bisimilarity is decidable. It is shown in this paper that the branching bisimilarity for both nOCN (normed One Co...
متن کاملReducing Weak to Strong Bisimilarity in CCP
Concurrent constraint programming (ccp) is a well-established model for concurrency that singles out the fundamental aspects of asynchronous systems whose agents (or processes) evolve by posting and querying (partial) information in a global medium. Bisimilarity is a standard behavioural equivalence in concurrency theory. However, only recently a well-behaved notion of bisimilarity for ccp, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software and Systems Modeling
سال: 2022
ISSN: ['1619-1374', '1619-1366']
DOI: https://doi.org/10.1007/s10270-022-01060-7